5 results
Counting Hamilton cycles in Dirac hypergraphs
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 30 / Issue 4 / July 2021
- Published online by Cambridge University Press:
- 17 December 2020, pp. 631-653
-
- Article
- Export citation
A rainbow blow-up lemma for almost optimally bounded edge-colourings
- Part of
-
- Journal:
- Forum of Mathematics, Sigma / Volume 8 / 2020
- Published online by Cambridge University Press:
- 30 October 2020, e37
-
- Article
-
- You have access
- Open access
- Export citation
Pseudorandom hypergraph matchings
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 29 / Issue 6 / November 2020
- Published online by Cambridge University Press:
- 22 July 2020, pp. 868-885
-
- Article
- Export citation
ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS
- Part of
-
- Journal:
- Forum of Mathematics, Sigma / Volume 7 / 2019
- Published online by Cambridge University Press:
- 14 January 2019, e1
-
- Article
-
- You have access
- Open access
- Export citation
A Stronger Bound for the Strong Chromatic Index
-
- Journal:
- Combinatorics, Probability and Computing / Volume 27 / Issue 1 / January 2018
- Published online by Cambridge University Press:
- 19 July 2017, pp. 21-43
-
- Article
- Export citation